Theorem Proving in Type Theory
نویسندگان
چکیده
As one aspect of the endeavor to c r e a te new i n t e l l e c t u a l t o o l s f o r mankind, we w ish to enable computers to p rove , and t o a s s i s t i n the p roo f s o f , theorems o f mathematics and ( e v e n t u a l l y ) o t h e r d i s c i p l i n e s which have ach ieved the r e q u i s i t e l o g i c a l p r e c i s i o n . For t h i s purpose, a p a r t i c u l a r l y s u i t a b l e f o rma l language i s Church 's f o r m u l a t i o n [4] o f type t heo ry w i t h A -convers ion . i n t h i s language t r a d i t i o n a l mathemat ica l n o t a t i o n s can be expressed ve ry d i r e c t l y , and the i n t u i t i v e d i s t i n c t i o n s between d i f f e r e n t types of mathemat ica l e n t i t i e s (such as numb e r s , f u n c t i o n s , and se ts o f f u n c t i o n s ) are made s y n t a c t i c a l l y e x p l i c i t .
منابع مشابه
A New Common Fixed Point Theorem for Suzuki Type Contractions via Generalized $Psi$-simulation Functions
In this paper, a new stratification of mappings, which is called $Psi$-simulation functions, is introduced to enhance the study of the Suzuki type weak-contractions. Some well-known results in weak-contractions fixed point theory are generalized by our researches. The methods have been appeared in proving the main results are new and different from the usual methods. Some suitable examples ar...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملTranslating Dependent Type Theory into Higher Order Logic
This paper describes a translation of the complex calculus of dependent type theory into the relatively simpler higher order logic originally introduced by Church. In particular, it shows how type dependency as found in Martin-LL of's Intuitionistic Type Theory can be simulated in the formulation of higher order logic mechanized by the HOL theorem-proving system. The outcome is a theorem prover...
متن کاملAutomated Theorem Proving in First-Order Logic Modulo: On the Difference between Type Theory and Set Theory
Resolution modulo is a first-order theorem proving method that can be applied both to first-order presentations of simple type theory (also called higher-order logic) and to set theory. When it is applied to some first-order presentations of type theory, it simulates exactly higherorder resolution. In this note, we compare how it behaves on type theory and on set theory. Higher-order theorem pr...
متن کاملTPS: An Interactive and Automatic Tool for Proving Theorems of Type Theory
This is a demonstration of TPS, a theorem proving system for classical type theory (Church’s typed λ-calculus). TPS can be used interactively or automatically, or in a combination of these modes. An important feature of TPS is the ability to translate between expansion proofs and natural deduction proofs. CATEGORY: Demonstration
متن کاملIntegrating Automated and Interactive Theorem Proving in Type Theory
We introduce an approach of integrating automated theorem proving techniques into the interactive theorem prover Agda. Our approach is generic and flexible, and can be combined with dependently typed programming. We have implemented the special cases of SAT solving and CTL model checking. The tool has been used for verifying the correctness of railway interlocking systems.
متن کامل